AVSA, Modified Vertex Support Algorithm for Approximation of MVC
نویسندگان
چکیده
منابع مشابه
AVSA, Modified Vertex Support Algorithm for Approximation of MVC
Minimum vertex cover is very important among the NP-optimization problems and got the attention of the researchers in the past decade. Approximation techniques are used to solve the NP problems to get either optimal or near optimal solutions in polynomial time. In this paper, a modified vertex support algorithm is proposed that make use of same data structure as that of VSA but with different v...
متن کاملDegree Contribution Algorithm for Approximation of MVC
Approximation methods are best way to deal NP optimization problems and MVC is one of these. In this research paper we have presented a new extra fast approximation algorithm for solving MVC generally in all graphs. The proposed algorithm is named degree contribution algorithm (DCA), a new data structure proposed and employed in this algorithm, name degree contribution. It is first time in lite...
متن کاملApproximation Algorithm for N-distance Minimal Vertex Cover Problem
Evolution of large scale networks demand for efficient way of communication in the networks. One way to propagate information in the network is to find vertex cover. In this paper we describe a variant of vertex cover problem naming it N-distance Vertex Minimal Cover(N-MVC) Problem to optimize information propagation throughout the network. A minimum subset of vertices of a unweighted and undir...
متن کاملA Local 2-Approximation Algorithm for the Vertex Cover Problem
We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (∆+ 1) synchronous communication rounds, where ∆ is the maximum degree of the graph. For ∆ = 3, we give a 2-approximation algorithm also for the weighted version of the problem.
متن کاملAn Improved Approximation Algorithm for Vertex Cover with Hard Capacities
In this paper we study the capacitated vertex cover problem, a generalization of the well-known vertex cover problem. Given a graph G = (V,E), the goal is to cover all the edges by picking a minimum cover using the vertices. When we pick a vertex, we can cover up to a pre-specified number of edges incident on this vertex (its capacity). The problem is clearly NP-hard as it generalizes the well-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Science and Technology
سال: 2014
ISSN: 2005-4238
DOI: 10.14257/ijast.2014.67.07